On limit cycles of monotone functions with symmetric connection graph
نویسندگان
چکیده
منابع مشابه
On limit cycles of monotone functions with symmetric connection graph
We study the length of the limit cycles of discrete monotone functions with symmetric connection graph. We construct a family of monotone functions such that the limit cycles are of maximum possible length, which is exponential in the number of variables. Furthermore, we prove for the class of monotone functions with more than two states and connection graph equal to a caterpillar that the leng...
متن کاملCovering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0, 1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augm...
متن کاملGraph coloring and monotone functions on posets
Proof. We denote V -[p] = { 1 , . . . , p}, A(G) is the set of acyclic orientations of G and a(G) = IA(G)I is their number. An n-coloring of G, c: V---> [n] induces an acyclic orientation DceA(G) as follows: If [x,y]eE is an edge, where c(x) > c(y) then in Dc this edge is oriented from x to y. Every acyclic orientation D ~ A(G) defines a partial order on V, which we denote by i>o. If D e A(G), ...
متن کاملLearning symmetric non-monotone submodular functions
We prove a new structural result for symmetric submodular functions. We use that result to obtain an efficient algorithm for approximately learning such functions in the passive, supervised learning setting. We also complement this result with a nearly matching lower bound. Our work provides the first results for learning a large class of non-monotone submodular functions under general distribu...
متن کاملLimit Cycles in Two Types of Symmetric LiÉnard Systems
Liénard systems and their generalized forms are classical and important models of nonlinear oscillators, and have been widely studied by mathematicians and scientists. The main problem considered is the maximal number of limit cycles that the system can have. In this paper, two types of symmetric polynomial Liénard systems are investigated and the maximal number of limit cycles bifurcating from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.010